Symbolic computation of reachability
نویسندگان
چکیده
منابع مشابه
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips...
متن کاملFinite Symbolic Reachability Graphs for High-Level Petri Nets
The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When high-level Petri nets are under consideration, the size of the graph most often is infinite or large. The reason for this combinato...
متن کاملSymbolic orthogonal projections: a new polyhedral representation for reachability analysis of hybrid systems
This thesis deals with reachability analysis of linear hybrid systems. Special importance is given to the treatment of the necessary geometrical operations. In the first part, we introduce a new representation class for convex polyhedra, the symbolic orthogonal projections (sops). A sop encodes a polyhedron as an orthogonal projection of a higher-dimensional polyhedron. This representation is t...
متن کاملSymbolic Computation of Minimal Probabilistic Reachability∗
This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A sym...
متن کاملLower Bounds for Symbolic Computation on Graphs
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007